The Kadison-Singer Conjecture
نویسنده
چکیده
We are given a large integer N , and a fixed basis {ei : 1 ≤ i ≤ N} for the space H = C . We are also given an N -by-N matrix H that has all its diagonal entries zero, and has norm one. If σ ⊆ {1, 2, . . . , N}, let Pσ be the projection onto the space Hσ := ∨{ei : i ∈ σ}. Call such a projection basic, and the range of a basic projection a basic subspace. For each constant 0 < γ < 1, we want to know
منابع مشابه
Interlacing families II:Mixed characteristic polynomials and the Kadison–Singer problem
We use the method of interlacing polynomials introduced in our previous article to prove two theorems known to imply a positive solution to the Kadison–Singer problem. The first is Weaver’s conjecture KS2, which is known to imply Kadison–Singer via a projection paving conjecture of Akemann and Anderson. The second is a formulation due to Casazza et al. of Anderson’s original paving conjecture(s...
متن کاملA pr 2 01 4 Interlacing Families II : Mixed Characteristic Polynomials and The Kadison - Singer Problem ∗
We use the method of interlacing families of polynomials introduced in [MSS13] to prove two theorems known to imply a positive solution to the Kadison–Singer problem. The first is Weaver’s conjecture KS2 [Wea04], which is known to imply Kadison–Singer via a projection paving conjecture of Akemann and Anderson [AA91]. The second is a formulation due to Casazza, et al., [CEKP07] of Anderson’s ori...
متن کامل2 6 Ju n 20 13 Interlacing Families II : Mixed Characteristic Polynomials and The Kadison - Singer Problem ∗
We use the method of interlacing families of polynomials introduced in [MSS13] to prove Weaver’s conjecture KS2 [Wea04], which is known to imply a positive solution to the Kadison–Singer problem via a projection paving conjecture of Akemann and Anderson [AA91]. Our proof goes through an analysis of the largest roots of a family of polynomials that we call the “mixed characteristic polynomials” ...
متن کاملA Decomposition Theorem for Frames and the Feichtinger Conjecture
In this paper we study the Feichtinger Conjecture in frame theory, which was recently shown to be equivalent to the 1959 Kadison-Singer Problem in C-Algebras. We will show that every bounded Bessel sequence can be decomposed into two subsets each of which is an arbitrarily small perturbation of a sequence with a finite orthogonal decomposition. This construction is then used to answer two open ...
متن کاملLecture 14 : Spectrally Thin Forests using Interlacing Polynomials
In the last lecture we showed that every k connected graph G has a linear sized O(1/k)-spectrally thin forest. We also briefly argued that if G has edges with effective resistance close to 1, then those edges cannot be in any spectrally thin subgraph of G. Suppose we are given a graph where the effective resistance of every edge is at most 1/k. Can we say that this graph has a O(1/k)-spectrally...
متن کاملEquivalents of the Kadison-singer Problem
In a series of papers it was recently shown that the 1959 Kadison-Singer Problem in C∗-Algebras is equivalent to fundamental unsolved problems in a dozen areas of research in pure mathematics, applied mathematics and engineering. Because of the length and depth of these papers, it has been difficult for people in the various impacted areas to get an overview of how their problems relate to the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006